Dynamic behavior of balanced NV-trees
نویسندگان
چکیده
منابع مشابه
Balanced Dynamic Content Addressing in Trees
Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings maintain minimal state information and enable efficient routing, but any such solutions currently result in either imbalanced content addressing, overloading individual nodes, or are unable to efficiently account for networ...
متن کاملDynamic Routing Tables Using Simple Balanced Search Trees
Various schemes for high-performance IP address lookups have been proposed recently. Pre-computations are usually used by the special designed IP address lookup algorithms for better performance in terms of lookup speed and memory requirement. However, the disadvantage of the pre-computation based schemes is that when a single prefix is added or deleted, the entire data structure may need to be...
متن کاملFully Dynamic Balanced and Distributed Search Trees with Logarithmic Costs
In this paper we consider the dictionary problem in a message passing distributed environment. We introduce a new version of an order-preserving distributed search tree, called BDST for Balanced and Distributed Search Tree, capable to both grow and shrink as long as keys are inserted and deleted. This is the rst distributed data structure to explicitly support both insertion and deletion with l...
متن کاملOn the Average Height of b-Balanced Ordered Trees
An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= h, where at least one leaf has a level equal to h − b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall...
متن کاملVerified Root-Balanced Trees
Andersson introduced general balanced trees, search trees based on the design principle of partial rebuilding: perform update operations naively until the tree becomes too unbalanced, at which point a whole subtree is rebalanced. We define and analyze a functional version of general balanced trees which we call root-balanced trees. Using a lightweight model of execution time, amortized logarith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multimedia Systems
سال: 2010
ISSN: 0942-4962,1432-1882
DOI: 10.1007/s00530-010-0199-4